A Note on Worst Case Eecient Meldable Priority Queues
نویسنده
چکیده
We give a simple implementation of meldable priority queues, achieving Insert, Find min, and Meld in O(1) worst case time, and Delete min and Delete in O(log n) worst case time.
منابع مشابه
Two new methods for transforming priority queues into double - ended priority queues ∗
Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of double-ended priority-queue operations. Using an efficient priority queue, the first transformation can produce a doubleended priority queue which guarantees the worst-case cost of O(1) for find -min , find-max , ...
متن کاملRandomized Meldable Priority Queues
We present a practical meldable priority queue implementation. All priority queue operations are very simple and their logarithmic time bound holds with high probability, which makes this data structure more suitable for real-time applications than those with only amortized performance guarantees. Our solution is also space-eecient, since it does not require storing any auxiliary information wi...
متن کاملRelaxed Fibonacci heaps : An alternative to Fibonacci heaps with worst case rather than amortized time bounds ∗ Chandrasekhar
We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations find minimum, insert, decrease key and meld, each in O(1) worst case time and delete and delete min in O(log n) worst case time. Introduction The implementation of priority queues is a classical problem in data structures. Priority queues find ...
متن کاملFast Meldable Priority Queues
We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(logn). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n). To our knowledge this is the first priority queue implementation ...
متن کاملWorst-Case Optimal Priority Queues via Extended Regular Counters
We consider the classical problem of representing a collection of priority queues under the operations find-min, insert , decrease, meld , delete, and delete-min. In the comparison-based model, if the first four operations are to be supported in constant time, the last two operations must take at least logarithmic time. Brodal showed that his worst-case efficient priority queues achieve these w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996